MULTILISP: a language for concurrent symbolic computation

Multilisp: a Language for Concurrent Symbolic Computation Acm Transactions on Programming Languages and Systems

Computational reflection makes it easy to solve problems that are otherwise difficult to address in Smalltalk-80, such as the construction of monitors, distributed objects, and futures, and can allow experimentation with new inheritance, delegation, and protection schemes. Full reflection is expensive to implement. However, the ability to override method lookup can bring much of the power of re...

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

synaps, a library for symbolic-numeric computation

The need to combine symbolic and numeric computations is ubiquitous in many problems. Starting with an exact description of the equations, in most cases, we will eventually have to compute an approximation of the solutions. Even more, in many problems the coefficients of the equations may only be known with some inaccuracy (due, for instance, to measurement errors). In this case, we are not dea...

A symbolic-numeric algorithm for genus computation

The genus computation problem is a classical subject in computer algebra. Presently, several symbolic algorithms are available for computing the genus of plane algebraic curves over an algebraically closed field, see [16, 18, 31]. There exist also good implementations for these algorithms in several packages of some well-known computer algebra systems such as: Maple, Magma, Singular, Axiom. We ...

Typing for Interactive Symbolic Computation